package codingforgreat.lchot150;

public class Lc122 {
    public int maxProfit(int[] prices) {
        int res = 0;
        for(int i = 1; i < prices.length;i++){
            if(prices[i] - prices[i - 1] > 0){
                res += prices[i] - prices[i - 1];
            }
        }
        return res;

    }
}
